Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

app2(app2(minus, x), 0) -> x
app2(app2(minus, app2(s, x)), app2(s, y)) -> app2(app2(minus, x), y)
app2(f, 0) -> app2(s, 0)
app2(f, app2(s, x)) -> app2(app2(minus, app2(s, x)), app2(g, app2(f, x)))
app2(g, 0) -> 0
app2(g, app2(s, x)) -> app2(app2(minus, app2(s, x)), app2(f, app2(g, x)))
app2(app2(map, fun), nil) -> nil
app2(app2(map, fun), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(fun, x)), app2(app2(map, fun), xs))
app2(app2(filter, fun), nil) -> nil
app2(app2(filter, fun), app2(app2(cons, x), xs)) -> app2(app2(app2(app2(filter2, app2(fun, x)), fun), x), xs)
app2(app2(app2(app2(filter2, true), fun), x), xs) -> app2(app2(cons, x), app2(app2(filter, fun), xs))
app2(app2(app2(app2(filter2, false), fun), x), xs) -> app2(app2(filter, fun), xs)

Q is empty.


↳ QTRS
  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

app2(app2(minus, x), 0) -> x
app2(app2(minus, app2(s, x)), app2(s, y)) -> app2(app2(minus, x), y)
app2(f, 0) -> app2(s, 0)
app2(f, app2(s, x)) -> app2(app2(minus, app2(s, x)), app2(g, app2(f, x)))
app2(g, 0) -> 0
app2(g, app2(s, x)) -> app2(app2(minus, app2(s, x)), app2(f, app2(g, x)))
app2(app2(map, fun), nil) -> nil
app2(app2(map, fun), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(fun, x)), app2(app2(map, fun), xs))
app2(app2(filter, fun), nil) -> nil
app2(app2(filter, fun), app2(app2(cons, x), xs)) -> app2(app2(app2(app2(filter2, app2(fun, x)), fun), x), xs)
app2(app2(app2(app2(filter2, true), fun), x), xs) -> app2(app2(cons, x), app2(app2(filter, fun), xs))
app2(app2(app2(app2(filter2, false), fun), x), xs) -> app2(app2(filter, fun), xs)

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

APP2(f, app2(s, x)) -> APP2(f, x)
APP2(app2(minus, app2(s, x)), app2(s, y)) -> APP2(minus, x)
APP2(app2(map, fun), app2(app2(cons, x), xs)) -> APP2(app2(cons, app2(fun, x)), app2(app2(map, fun), xs))
APP2(app2(filter, fun), app2(app2(cons, x), xs)) -> APP2(app2(app2(filter2, app2(fun, x)), fun), x)
APP2(app2(filter, fun), app2(app2(cons, x), xs)) -> APP2(app2(app2(app2(filter2, app2(fun, x)), fun), x), xs)
APP2(g, app2(s, x)) -> APP2(app2(minus, app2(s, x)), app2(f, app2(g, x)))
APP2(f, app2(s, x)) -> APP2(g, app2(f, x))
APP2(app2(app2(app2(filter2, true), fun), x), xs) -> APP2(app2(cons, x), app2(app2(filter, fun), xs))
APP2(f, app2(s, x)) -> APP2(minus, app2(s, x))
APP2(app2(map, fun), app2(app2(cons, x), xs)) -> APP2(fun, x)
APP2(app2(filter, fun), app2(app2(cons, x), xs)) -> APP2(filter2, app2(fun, x))
APP2(app2(minus, app2(s, x)), app2(s, y)) -> APP2(app2(minus, x), y)
APP2(f, app2(s, x)) -> APP2(app2(minus, app2(s, x)), app2(g, app2(f, x)))
APP2(app2(app2(app2(filter2, true), fun), x), xs) -> APP2(app2(filter, fun), xs)
APP2(app2(filter, fun), app2(app2(cons, x), xs)) -> APP2(app2(filter2, app2(fun, x)), fun)
APP2(app2(app2(app2(filter2, false), fun), x), xs) -> APP2(filter, fun)
APP2(g, app2(s, x)) -> APP2(minus, app2(s, x))
APP2(app2(map, fun), app2(app2(cons, x), xs)) -> APP2(app2(map, fun), xs)
APP2(app2(filter, fun), app2(app2(cons, x), xs)) -> APP2(fun, x)
APP2(app2(app2(app2(filter2, true), fun), x), xs) -> APP2(filter, fun)
APP2(f, 0) -> APP2(s, 0)
APP2(g, app2(s, x)) -> APP2(g, x)
APP2(g, app2(s, x)) -> APP2(f, app2(g, x))
APP2(app2(app2(app2(filter2, true), fun), x), xs) -> APP2(cons, x)
APP2(app2(app2(app2(filter2, false), fun), x), xs) -> APP2(app2(filter, fun), xs)
APP2(app2(map, fun), app2(app2(cons, x), xs)) -> APP2(cons, app2(fun, x))

The TRS R consists of the following rules:

app2(app2(minus, x), 0) -> x
app2(app2(minus, app2(s, x)), app2(s, y)) -> app2(app2(minus, x), y)
app2(f, 0) -> app2(s, 0)
app2(f, app2(s, x)) -> app2(app2(minus, app2(s, x)), app2(g, app2(f, x)))
app2(g, 0) -> 0
app2(g, app2(s, x)) -> app2(app2(minus, app2(s, x)), app2(f, app2(g, x)))
app2(app2(map, fun), nil) -> nil
app2(app2(map, fun), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(fun, x)), app2(app2(map, fun), xs))
app2(app2(filter, fun), nil) -> nil
app2(app2(filter, fun), app2(app2(cons, x), xs)) -> app2(app2(app2(app2(filter2, app2(fun, x)), fun), x), xs)
app2(app2(app2(app2(filter2, true), fun), x), xs) -> app2(app2(cons, x), app2(app2(filter, fun), xs))
app2(app2(app2(app2(filter2, false), fun), x), xs) -> app2(app2(filter, fun), xs)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

APP2(f, app2(s, x)) -> APP2(f, x)
APP2(app2(minus, app2(s, x)), app2(s, y)) -> APP2(minus, x)
APP2(app2(map, fun), app2(app2(cons, x), xs)) -> APP2(app2(cons, app2(fun, x)), app2(app2(map, fun), xs))
APP2(app2(filter, fun), app2(app2(cons, x), xs)) -> APP2(app2(app2(filter2, app2(fun, x)), fun), x)
APP2(app2(filter, fun), app2(app2(cons, x), xs)) -> APP2(app2(app2(app2(filter2, app2(fun, x)), fun), x), xs)
APP2(g, app2(s, x)) -> APP2(app2(minus, app2(s, x)), app2(f, app2(g, x)))
APP2(f, app2(s, x)) -> APP2(g, app2(f, x))
APP2(app2(app2(app2(filter2, true), fun), x), xs) -> APP2(app2(cons, x), app2(app2(filter, fun), xs))
APP2(f, app2(s, x)) -> APP2(minus, app2(s, x))
APP2(app2(map, fun), app2(app2(cons, x), xs)) -> APP2(fun, x)
APP2(app2(filter, fun), app2(app2(cons, x), xs)) -> APP2(filter2, app2(fun, x))
APP2(app2(minus, app2(s, x)), app2(s, y)) -> APP2(app2(minus, x), y)
APP2(f, app2(s, x)) -> APP2(app2(minus, app2(s, x)), app2(g, app2(f, x)))
APP2(app2(app2(app2(filter2, true), fun), x), xs) -> APP2(app2(filter, fun), xs)
APP2(app2(filter, fun), app2(app2(cons, x), xs)) -> APP2(app2(filter2, app2(fun, x)), fun)
APP2(app2(app2(app2(filter2, false), fun), x), xs) -> APP2(filter, fun)
APP2(g, app2(s, x)) -> APP2(minus, app2(s, x))
APP2(app2(map, fun), app2(app2(cons, x), xs)) -> APP2(app2(map, fun), xs)
APP2(app2(filter, fun), app2(app2(cons, x), xs)) -> APP2(fun, x)
APP2(app2(app2(app2(filter2, true), fun), x), xs) -> APP2(filter, fun)
APP2(f, 0) -> APP2(s, 0)
APP2(g, app2(s, x)) -> APP2(g, x)
APP2(g, app2(s, x)) -> APP2(f, app2(g, x))
APP2(app2(app2(app2(filter2, true), fun), x), xs) -> APP2(cons, x)
APP2(app2(app2(app2(filter2, false), fun), x), xs) -> APP2(app2(filter, fun), xs)
APP2(app2(map, fun), app2(app2(cons, x), xs)) -> APP2(cons, app2(fun, x))

The TRS R consists of the following rules:

app2(app2(minus, x), 0) -> x
app2(app2(minus, app2(s, x)), app2(s, y)) -> app2(app2(minus, x), y)
app2(f, 0) -> app2(s, 0)
app2(f, app2(s, x)) -> app2(app2(minus, app2(s, x)), app2(g, app2(f, x)))
app2(g, 0) -> 0
app2(g, app2(s, x)) -> app2(app2(minus, app2(s, x)), app2(f, app2(g, x)))
app2(app2(map, fun), nil) -> nil
app2(app2(map, fun), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(fun, x)), app2(app2(map, fun), xs))
app2(app2(filter, fun), nil) -> nil
app2(app2(filter, fun), app2(app2(cons, x), xs)) -> app2(app2(app2(app2(filter2, app2(fun, x)), fun), x), xs)
app2(app2(app2(app2(filter2, true), fun), x), xs) -> app2(app2(cons, x), app2(app2(filter, fun), xs))
app2(app2(app2(app2(filter2, false), fun), x), xs) -> app2(app2(filter, fun), xs)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 3 SCCs with 15 less nodes.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
            ↳ QDPOrderProof
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

APP2(app2(minus, app2(s, x)), app2(s, y)) -> APP2(app2(minus, x), y)

The TRS R consists of the following rules:

app2(app2(minus, x), 0) -> x
app2(app2(minus, app2(s, x)), app2(s, y)) -> app2(app2(minus, x), y)
app2(f, 0) -> app2(s, 0)
app2(f, app2(s, x)) -> app2(app2(minus, app2(s, x)), app2(g, app2(f, x)))
app2(g, 0) -> 0
app2(g, app2(s, x)) -> app2(app2(minus, app2(s, x)), app2(f, app2(g, x)))
app2(app2(map, fun), nil) -> nil
app2(app2(map, fun), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(fun, x)), app2(app2(map, fun), xs))
app2(app2(filter, fun), nil) -> nil
app2(app2(filter, fun), app2(app2(cons, x), xs)) -> app2(app2(app2(app2(filter2, app2(fun, x)), fun), x), xs)
app2(app2(app2(app2(filter2, true), fun), x), xs) -> app2(app2(cons, x), app2(app2(filter, fun), xs))
app2(app2(app2(app2(filter2, false), fun), x), xs) -> app2(app2(filter, fun), xs)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


APP2(app2(minus, app2(s, x)), app2(s, y)) -> APP2(app2(minus, x), y)
The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial Order [17,21] with Interpretation:

POL( s ) = max{0, -2}


POL( APP2(x1, x2) ) = x1 + 1


POL( minus ) = 3


POL( app2(x1, x2) ) = 3x1 + 2x2 + 3



The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ PisEmptyProof
          ↳ QDP
          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

app2(app2(minus, x), 0) -> x
app2(app2(minus, app2(s, x)), app2(s, y)) -> app2(app2(minus, x), y)
app2(f, 0) -> app2(s, 0)
app2(f, app2(s, x)) -> app2(app2(minus, app2(s, x)), app2(g, app2(f, x)))
app2(g, 0) -> 0
app2(g, app2(s, x)) -> app2(app2(minus, app2(s, x)), app2(f, app2(g, x)))
app2(app2(map, fun), nil) -> nil
app2(app2(map, fun), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(fun, x)), app2(app2(map, fun), xs))
app2(app2(filter, fun), nil) -> nil
app2(app2(filter, fun), app2(app2(cons, x), xs)) -> app2(app2(app2(app2(filter2, app2(fun, x)), fun), x), xs)
app2(app2(app2(app2(filter2, true), fun), x), xs) -> app2(app2(cons, x), app2(app2(filter, fun), xs))
app2(app2(app2(app2(filter2, false), fun), x), xs) -> app2(app2(filter, fun), xs)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

APP2(f, app2(s, x)) -> APP2(f, x)
APP2(g, app2(s, x)) -> APP2(g, x)
APP2(g, app2(s, x)) -> APP2(f, app2(g, x))
APP2(f, app2(s, x)) -> APP2(g, app2(f, x))

The TRS R consists of the following rules:

app2(app2(minus, x), 0) -> x
app2(app2(minus, app2(s, x)), app2(s, y)) -> app2(app2(minus, x), y)
app2(f, 0) -> app2(s, 0)
app2(f, app2(s, x)) -> app2(app2(minus, app2(s, x)), app2(g, app2(f, x)))
app2(g, 0) -> 0
app2(g, app2(s, x)) -> app2(app2(minus, app2(s, x)), app2(f, app2(g, x)))
app2(app2(map, fun), nil) -> nil
app2(app2(map, fun), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(fun, x)), app2(app2(map, fun), xs))
app2(app2(filter, fun), nil) -> nil
app2(app2(filter, fun), app2(app2(cons, x), xs)) -> app2(app2(app2(app2(filter2, app2(fun, x)), fun), x), xs)
app2(app2(app2(app2(filter2, true), fun), x), xs) -> app2(app2(cons, x), app2(app2(filter, fun), xs))
app2(app2(app2(app2(filter2, false), fun), x), xs) -> app2(app2(filter, fun), xs)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

APP2(app2(app2(app2(filter2, true), fun), x), xs) -> APP2(app2(filter, fun), xs)
APP2(app2(map, fun), app2(app2(cons, x), xs)) -> APP2(fun, x)
APP2(app2(filter, fun), app2(app2(cons, x), xs)) -> APP2(app2(app2(app2(filter2, app2(fun, x)), fun), x), xs)
APP2(app2(app2(app2(filter2, false), fun), x), xs) -> APP2(app2(filter, fun), xs)
APP2(app2(filter, fun), app2(app2(cons, x), xs)) -> APP2(fun, x)
APP2(app2(map, fun), app2(app2(cons, x), xs)) -> APP2(app2(map, fun), xs)

The TRS R consists of the following rules:

app2(app2(minus, x), 0) -> x
app2(app2(minus, app2(s, x)), app2(s, y)) -> app2(app2(minus, x), y)
app2(f, 0) -> app2(s, 0)
app2(f, app2(s, x)) -> app2(app2(minus, app2(s, x)), app2(g, app2(f, x)))
app2(g, 0) -> 0
app2(g, app2(s, x)) -> app2(app2(minus, app2(s, x)), app2(f, app2(g, x)))
app2(app2(map, fun), nil) -> nil
app2(app2(map, fun), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(fun, x)), app2(app2(map, fun), xs))
app2(app2(filter, fun), nil) -> nil
app2(app2(filter, fun), app2(app2(cons, x), xs)) -> app2(app2(app2(app2(filter2, app2(fun, x)), fun), x), xs)
app2(app2(app2(app2(filter2, true), fun), x), xs) -> app2(app2(cons, x), app2(app2(filter, fun), xs))
app2(app2(app2(app2(filter2, false), fun), x), xs) -> app2(app2(filter, fun), xs)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


APP2(app2(map, fun), app2(app2(cons, x), xs)) -> APP2(fun, x)
APP2(app2(filter, fun), app2(app2(cons, x), xs)) -> APP2(app2(app2(app2(filter2, app2(fun, x)), fun), x), xs)
APP2(app2(filter, fun), app2(app2(cons, x), xs)) -> APP2(fun, x)
APP2(app2(map, fun), app2(app2(cons, x), xs)) -> APP2(app2(map, fun), xs)
The remaining pairs can at least be oriented weakly.

APP2(app2(app2(app2(filter2, true), fun), x), xs) -> APP2(app2(filter, fun), xs)
APP2(app2(app2(app2(filter2, false), fun), x), xs) -> APP2(app2(filter, fun), xs)
Used ordering: Polynomial Order [17,21] with Interpretation:

POL( map ) = 2


POL( 0 ) = 1


POL( APP2(x1, x2) ) = 2x2 + 1


POL( s ) = 2


POL( minus ) = 1


POL( nil ) = 3


POL( cons ) = 2


POL( true ) = 0


POL( filter ) = max{0, -3}


POL( false ) = 1


POL( app2(x1, x2) ) = 2x1 + 2x2 + 1


POL( f ) = 0


POL( filter2 ) = 0


POL( g ) = 0



The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

APP2(app2(app2(app2(filter2, true), fun), x), xs) -> APP2(app2(filter, fun), xs)
APP2(app2(app2(app2(filter2, false), fun), x), xs) -> APP2(app2(filter, fun), xs)

The TRS R consists of the following rules:

app2(app2(minus, x), 0) -> x
app2(app2(minus, app2(s, x)), app2(s, y)) -> app2(app2(minus, x), y)
app2(f, 0) -> app2(s, 0)
app2(f, app2(s, x)) -> app2(app2(minus, app2(s, x)), app2(g, app2(f, x)))
app2(g, 0) -> 0
app2(g, app2(s, x)) -> app2(app2(minus, app2(s, x)), app2(f, app2(g, x)))
app2(app2(map, fun), nil) -> nil
app2(app2(map, fun), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(fun, x)), app2(app2(map, fun), xs))
app2(app2(filter, fun), nil) -> nil
app2(app2(filter, fun), app2(app2(cons, x), xs)) -> app2(app2(app2(app2(filter2, app2(fun, x)), fun), x), xs)
app2(app2(app2(app2(filter2, true), fun), x), xs) -> app2(app2(cons, x), app2(app2(filter, fun), xs))
app2(app2(app2(app2(filter2, false), fun), x), xs) -> app2(app2(filter, fun), xs)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 0 SCCs with 2 less nodes.